Cities as Small Worlds

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Small Worlds as Navigable Augmented Networks

The small world phenomenon, a.k.a. the six degree of separation between individuals, was identified by Stanley Milgram at the end of the 60s. Milgram experiment demonstrated that letters from arbitrary sources and bound to an arbitrary target can be transmitted along short chains of closely related individuals, based solely on some characteristics of the target (professional occupation, state o...

متن کامل

Small worlds

Small world models are networks consisting of many local links and fewer long range ‘shortcuts’. In this paper, we consider some particular instances, and rigorously investigate the distribution of their inter–point network distances. Our results are framed in terms of approximations, whose accuracy increases with the size of the network. We also give some insight into how the reduction in typi...

متن کامل

Small Worlds

In this tutorial we present some basic ideas behind the notion of Small World. We review the state-of-the-art in the eld, and put emphasis on some recent developments, in connection with analyzing the structure of the Web.

متن کامل

Small Cycles in Small Worlds

Petra M. Gleiss, Peter F. Stadler, Andreas Wagner, and David A. Fell Institut für Theoretische Chemie, Universität Wien Währingerstraße 17, A-1090 Wien, Austria The Santa Fe Institute, 1399 Hyde Park Rd., Santa Fe NM 87501, USA Dept. of Biology, University of New Mexico, 167A Castetter Hall, Albuquerque, NM-817131-1091, School of Biological & Molecular Sciences Oxford Brookes University, Oxford...

متن کامل

shrinks even small worlds

We consider small world graphs as defined by Kleinberg (2000), i.e., graphs obtained from a ddimensional mesh by adding links chosen at random according to the d-harmonic distribution. In these graphs, greedy routing performs in O(log2 n) expected number of steps. We introduce indirect-greedy routing. We show that giving O(log2 n) bits of topological awareness per node enables indirect-greedy r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Environment and Planning B: Planning and Design

سال: 2001

ISSN: 0265-8135,1472-3417

DOI: 10.1068/b2805ed